Slow Mixing of Markov Chains Using Fault Lines and Fat Contours

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Community Detection Using Slow Mixing Markov Models

The task of community detection in a graph formalizes the intuitive task of grouping together subsets of vertices such that vertices within clusters are connected tighter than those in disparate clusters. This paper approaches community detection in graphs by constructing Markov random walks on the graphs. The mixing properties of the random walk are then used to identify communities. We use co...

متن کامل

Rapidly-mixing Markov Chains

INTRODUCTION Andrei Andreyevich Markov was a Russian mathematician born in 1856. Markov's main interests were in number theory, continued fractions, and approximation theory. He studied under P. Chebyshev and worked in the field of probability theory. Markov pioneered work in the area of stochastic processes by creating a model called a Markov chain—a random walk on a state space. His work has ...

متن کامل

Markov chains and mixing times

For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j ∈ S. We write P = [pij] for the matrix of transition probabilities. Elements of S can be interpreted as various possible states of whatever system we are interested in studying, and pij represents the probability that the system is in state j at time n+ 1, if it is sta...

متن کامل

Markov Chains and Mixing Times

Titles in this series are co-published with the Mathematical Sciences Research Institute (MSRI).

متن کامل

Markov Chains and Mixing Times

This paper introduces the idea of a Markov chain, a random process which is independent of all states but its current one. We analyse some basic properties of such processes, introduce the notion of a stationary distribution, and examine methods of bounding the time it takes to become close to such a distribution.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2008

ISSN: 0178-4617,1432-0541

DOI: 10.1007/s00453-008-9246-3